Non-interleaving semantics for mobile processes
نویسندگان
چکیده
منابع مشابه
Non-Interleaving Semantics for Mobile Processes
This paper studies causality in the-calculus. Our notion of causality combines the dependencies given by the syntactic structure of processes with those originated by passing names. Our studies show that two transitions not causally related may however occur in a xed ordering in any computation, i.e., the-calculus may implicitly express a precedence between actions. The same partial order of tr...
متن کاملLocality and Interleaving Semantics in Calculi for Mobile Processes
Process algebra semantics can be categorised into non-interleaving semantics, where parallel composition is considered a primitive operator, and interleaving semantics , where concurrency is reduced to sequentiality plus nondeterminism. The former have an appealing intuitive justiication, but the latter are mathematically more tractable. This paper addresses the study of non-interleaving semant...
متن کاملUnderstanding Mobile Agents via a Non-Interleaving Semantics for Facile
Mobile agents, i.e. pieces of programs that can be sent around networks of computers, are starting to appear on the Internet. Such programs may be seen as an enrichment of traditional distributed computing. Since mobile agents may carry communication links with them as they move across the network, they create very dynamic interconnection structures that can be extremely complex to analyse. In ...
متن کاملA Non–Interleaving Semantics for MSC
In this paper, we develop a non–interleaving semantics and an interleaving semantics for MSC’96 based on the model of families of partially ordered sets. These semantics are no denotational semantics, but are defined via translations of the textual syntax for MSC’96 into a process algebra. We show that the interleaving semantics agrees on BMSC with the standardized semantics for MSC’92, while t...
متن کاملQuantitative testing semantics for non-interleaving
This paper presents a non-interleaving denotational semantics for the π-calculus. The basic idea is to define a notion of test where the outcome is not only whether a given process passes a given test, but also in how many different ways it can pass it. More abstractly, the set of possible outcomes for tests forms a semiring, and the set of process interpretations appears as a module over this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)80003-6